Asymptotic Properties of Protected Nodes in Random Recursive Trees
نویسندگان
چکیده
We investigate protected nodes in random recursive trees. The exact mean of the number of such nodes is obtained by recurrence, and a linear asymptotic equivalent follows. A nonlinear recurrence for the variance shows that the variance grows linearly, too. It follows that the number of protected nodes in a random recursive tree, upon proper scaling, converges in probability to a constant.
منابع مشابه
The eccentric connectivity index of bucket recursive trees
If $G$ is a connected graph with vertex set $V$, then the eccentric connectivity index of $G$, $xi^c(G)$, is defined as $sum_{vin V(G)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. In this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملDegrees in $k$-minimal label random recursive trees
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
متن کاملStein Couplings to Show Limit Laws for Fringe Trees
The binary search tree or Quicksort is the most used of all sorting algorithm, since it is both fast and simple. The random recursive tree is another extensively studied random tree. We have examined fringe trees in these two types of random trees, since the study of such subtrees appears to be an effective approach towards defining characteristics also of the whole tree. By using a representat...
متن کاملProtected Nodes and Fringe Subtrees in Some Random Trees
We study protected nodes in various classes of random rooted trees by putting them in the general context of fringe subtrees introduced by Aldous (1991). Several types of random trees are considered: simply generated trees (or conditioned Galton– Watson trees), which includes several cases treated separately by other authors, binary search trees and random recursive trees. This gives unified an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Applied Probability
دوره 52 شماره
صفحات -
تاریخ انتشار 2015